Add to ORKGWe construct a fast algorithm for the computation of discrete Gauss transforms with complex parameters, capable of dealing with non equispaced points. Our algorithm is based on the fast Fourier transform at non equispaced knots and requires only O(N) arithmetic operations. Key words and phrases. Gauss transform; Unequally spaced Fourier transforms; Fast algorithms; Chirped Gaussian; NFFT
New algorithms for computing the discrete W transform (DWT) of arbitrary lengths are presented. It i...
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DF...
Abstract. The fast Gauss transform proposed by Greengard and Strain reduces the computational comple...
We develop fast algorithms for unequally spaced discrete Laplace transforms with complex parameters,...
The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to ...
Abstract. The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points ...
This paper proposes fast algorithms for computing the discrete Fourier transform for real-valued seq...
The Fast Fourier Transform (FFT) algorithm of Cooley and Tukey [7] requires sampling on an equally s...
A new version of the fast Gauss transform (FGT) is introduced which is based on a truncated Chebyshe...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
We present a novel approach for the fast approximation of the discrete Gauss transform in higher dim...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
This thesis develops several new algorithms for computing the discrete Fourier transform (DFT). The ...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
The fast Gauss transform proposed by Greengard and Strain reduces the computational complexity of t...
New algorithms for computing the discrete W transform (DWT) of arbitrary lengths are presented. It i...
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DF...
Abstract. The fast Gauss transform proposed by Greengard and Strain reduces the computational comple...
We develop fast algorithms for unequally spaced discrete Laplace transforms with complex parameters,...
The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to ...
Abstract. The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points ...
This paper proposes fast algorithms for computing the discrete Fourier transform for real-valued seq...
The Fast Fourier Transform (FFT) algorithm of Cooley and Tukey [7] requires sampling on an equally s...
A new version of the fast Gauss transform (FGT) is introduced which is based on a truncated Chebyshe...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
We present a novel approach for the fast approximation of the discrete Gauss transform in higher dim...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
This thesis develops several new algorithms for computing the discrete Fourier transform (DFT). The ...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
The fast Gauss transform proposed by Greengard and Strain reduces the computational complexity of t...
New algorithms for computing the discrete W transform (DWT) of arbitrary lengths are presented. It i...
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DF...
Abstract. The fast Gauss transform proposed by Greengard and Strain reduces the computational comple...